Analog IC Design Using Precomputed Lookup Tables: Challenges and Solutions
نویسندگان
چکیده
منابع مشابه
Iterating Lookup Tables Efficiently
We show that every function f implemented as a lookup table can, by increasing the storage space by a small constant factor, be implemented such that the computational complexity of evaluating fm(x) is small independently of m and x.
متن کاملAnalog and mixed-signal IC design and design methodologies
During the past decades, we have witnessed a progressive substitution of analog-based solutions by digital ones, in parallel with the continuous evolution of technological processes, especially CMOS, towards deep submicron technologies. This technological shrinkage has enabled the integration of more and more functionalities on a single chip, with the consequent reduction in area, cost and powe...
متن کاملOblivious Lookup Tables
We consider the following question: given a group-homomorphic public-key encryption E, a ciphertext c = E(x, pk) hiding a value x using a key pk, and a ”suitable” description of a function f , can we evaluate E(f(x), pk) without decrypting c? We call this an oblivious lookup table and show the existence of such a primitive. To this end, we describe a concrete construction, discuss its security ...
متن کاملIC Design of IPv6 Routing Lookup for High Speed Networks
In recent years, there are many researches for routing lookup. Most of them can achieve high average search throughput for IPv4, but they are slow in the updating speed and cannot suit to 128 bits IPv6 address even in hardware architecture. This paper proposed a routing lookup system which contains an ASIC of routing lookup table and offchip memory sets. In the performance analysis, 91.89% rout...
متن کاملSet Reconciliation and File Synchronization Using Invertible Bloom Lookup Tables
As more and more data migrate to the cloud, and the same files become accessible from multiple different machines, finding effective ways to ensure data consistency is becoming increasingly important. In this thesis, we cover current methods for efficiently maintaining sets of objects without the use of logs or other prior context, which is better known as the set reconciliation problem. We als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3010875